Optimization of memory based multiplication for LUT
نویسندگان
چکیده
The multiplier uses LUT’s as memory for their computations. The antisymmetric product coding (APC) and odd-multiple-storage (OMS) techniques were proposed for look-up-table (LUT) design. The APC and OMS techniques used for efficient memory-based multiplication. Therefore the combined approach provides a reduction in LUT size to onefourth of the conventional LUT. APC approach is combined with the OMS technique, the two’s complement operations could be very much simplified since the input address and LUT output could always be transformed into odd integers. The proposed LUT design for small input sizes can be used for efficient implementation of high precision multiplication by input operand decomposition. The LUT based multiplier involves 5-bit word size. The area and delay can be improved. In multiplier if we reduce the number of LUT then delay can be reduced. Memory-based computing is well suited for many digital signal processing (DSP) algorithms, which involve multiplication with a fixed set of coefficients.
منابع مشابه
An Efficient LUT Design on FPGA for Memory-Based Multiplication
An efficient Lookup Table (LUT) design for memory-based multiplier is proposed. This multiplier can be preferred in DSP computation where one of the inputs, which is filter coefficient to the multiplier, is fixed. In this design, all possible product terms of input multiplicand with the fixed coefficient are stored directly in memory. In contrast to an earlier proposition Odd Multiple Storage ...
متن کاملImplementation of Memory Based Multiplication Using Micro wind Software
The antisymmetric product coding techniques for lookup-table design for memory-based multipliers used in digital circuits. By using this techniques it results in reduction of the LUT. We present a different form of APC for efficient optimization of memory based applications. The proposed combined approach provides a reduction in size compared to the conventional LUT. It is shown that the propos...
متن کاملInnovation on a Memory Based Multiplier
Several architectures have been reported in the literature for memory-based implementation of DSP algorithms involving orthogonal transforms and digital filters. A common way of implementing constant multiplication is by a series of shift and adds operations. If the multiplier is represented in Canonical Signed Digit (CSD) form, then the number of additions (or subtractions) used will be a mini...
متن کاملEfficient Method for Look-Up-Table Design in Memory Based Fir Filters
Distributed arithmetic (DA)-based computation is well known for efficient memory-based implementation of Finite impulse response (FIR) filter where the filter outputs are computed as inner-product of input-sample vectors and filter-coefficient vector. In this paper, we show that the LUT multiplier based approach in which the memory elements store all the possible values of product of filter co-...
متن کاملHardware Efficient Approach for Memoryless-Based Multiplication and Its Application to FIR Filter
In conventional memory-based multiplication design, the multiplier is replaced by a read only memory (ROM). Since the memory size increases exponentially with the input length, in this paper, a modified hardwareefficient approach for memoryless-based multiplication is proposed. The very large scale integration (VLSI) measure indicates that the proposed approach involves less hardware complexity...
متن کامل